Gaussian integral circulant digraphs
نویسندگان
چکیده
منابع مشابه
Infinite Circulant Digraphs and Random Infinite Circulant Digraphs
In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both oneand two-way infinite Hamiltonian paths.
متن کاملkernels in circulant digraphs
a kernel $j$ of a digraph $d$ is an independent set of vertices of $d$ such that for every vertex $w,in,v(d),setminus,j$ there exists an arc from $w$ to a vertex in $j.$in this paper, among other results, a characterization of $2$-regular circulant digraph having a kernel is obtained. this characterization is a partial solution to the following problem: characterize circulant digraphs which hav...
متن کاملCirculant Digraphs and Monomial Ideals
It is known that there exists a Minimum Distance Diagram (MDD) for circulant digraphs of degree two (or double-loop computer networks) which is an L-shape. Its description provides the diameter and the average distance of the graph on constant time. In this paper we clarify, justify and extend these diagrams to circulant digraphs of arbitrary degree by presenting monomial ideals as a natural to...
متن کاملRecognizing Bipartite Incident-Graphs of Circulant Digraphs
Knödel graphs and Fibonacci graphs are two classes of bipartite incident-graph of circulant digraphs. Both graphs have been extensively studied for the purpose of fast communications in networks, and they have deserved a lot of attention in this context. In this paper, we show that there exists an O(n log n)-time algorithm to recognize Knödel graphs, and that the same technique applies to Fibon...
متن کاملNon-singular circulant graphs and digraphs
For a fixed positive integer n, let Wn be the permutation matrix corresponding to the permutation ( 1 2 · · · n− 1 n 2 3 · · · n 1 ) . In this article, it is shown that a symmetric matrix with rational entries is circulant if, and only if, it lies in the subalgebra of Q[x]/〈x−1〉 generated by Wn+W −1 n . On the basis of this, the singularity of graphs on n-vertices is characterized algebraically...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.09.019